Finitely-Verifiable Classes of Sentences
نویسنده
چکیده
This paper proposes a notion of finitely-verifiable classes of sentences. Informally, a class of sentences is finitely-verifiable if whether a sentence in this class is a theorem of a given theory can be checked with respect to a finite set of models of the theory. The usefulness of this notion is illustrated using examples from arithmetics, first-order logic, game theory, and planning.
منابع مشابه
6 Hall ’ s Theorem for Limit Groups
A celebrated theorem of Marshall Hall implies that finitely generated free groups are subgroup separable and that all of their finitely generated subgroups are retracts of finite-index subgroups. We use topological techniques inspired by the work of Stallings to prove that all limit groups share these two properties. This answers a question of Sela and provides a purely topological proof that f...
متن کاملM ay 2 00 6 Hall ’ s Theorem for Limit Groups
A celebrated theorem of Marshall Hall implies that finitely generated free groups are subgroup separable and that all of their finitely generated subgroups are retracts of finite-index subgroups. We use topological techniques inspired by the work of Stallings to prove that all limit groups share these two properties. This answers a question of Sela and provides a purely topological proof that f...
متن کاملA logical approach to asymptotic combinatorics II: Monadic second-order properties
In Compton [3] we began an investigation of a general approach to asymptotic problems in combinatorics. These problems involve determining probabilities of certain properties holding in large, finite structures randomly chosen from certain classes. The properties we considered were those expressible in first order logic L,,, and the classes were those closed under disjoint unions and components...
متن کاملConstruction of sentences with specific interpretability properties
A construction is presented for generating sentences that satisfy a recursively enumerable set of interpretability properties. This construction is then used to prove three previously announced results concerning the lattice of local interpretability types of theories (also known as the Lattice of Chapters). The purpose of this paper is to prove three theorems originally announced without proof...
متن کاملSatisfaction classes in nonstandard models of first-order arithmetic
A satisfaction class is a set of nonstandard sentences respecting Tarski’s truth definition. We are mainly interested in full satisfaction classes, i.e., satisfaction classes which decides all nonstandard sentences. Kotlarski, Krajewski and Lachlan proved in 1981 that a countable model of PA admits a satisfaction class if and only if it is recursively saturated. A proof of this fact is presente...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007